Reduced complexity recursive least square lattice structure adaptive filter by means of limited recursion of the backward and forward error prediction squares

ABSTRACT

A method for reducing a computational complexity of an m-stage adaptive filter is provided by updating recursively forward and backward error prediction square terms for a first portion of a length of the adaptive filter, and keeping the updated forward and backward error prediction square terms constant for a second portion of the length of the adaptive filter.

RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 60/692,345, filed Jun. 20, 2005, U.S. Provisional Application No. 60/692,236, filed Jun. 20, 2005, and U.S. Provisional Application No. 60/692,347, filed Jun. 20, 2005, all of which are incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates in general to adaptive filters and, more particularly to a reduced complexity recursive least square lattice structure adaptive filter.

BACKGROUND

Adaptive filters are found in a wide range of applications and come in a wide variety of configurations each with distinctive properties. A particular configuration chosen may depend on specific properties needed for a target application. These properties, which include among others, rate of convergence, mis-adjustment, tracking, and computational requirements, are evaluated and weighed against each other to determine the appropriate configuration for the target application.

Of particular interest when choosing an adaptive filter configuration for use in a non-stationary signal environment are the rate of convergence, the mis-adjustment and the tracking capability. Good tracking capability is generally a function of the convergence rate and mis-adjustment properties of a corresponding algorithm. However, these properties may be contradictory in nature, in that a higher convergence rate will typically result in a higher convergence error or mis-adjustment of the resulting filter.

A recursive least squares (RLS) algorithm is generally a good tool for the non-stationary signal environment due to its fast convergence rate and low level of mis-adjustment. One particular form of the RLS algorithm is a recursive least squares lattice (RLSL) algorithm. The initial RLSL algorithm was introduced by Simon Haykin, and can be found in the “Adaptive Filter Theory Third Edition” book. The RLS class of adaptive filters exhibit fast convergence rates and are relatively insensitive to variations in an eigenvalue spread. Eigenvalues are a measure of correlation properties of the reference signal and the eigenvalue spread is typically defined as a ratio of the highest eigenvalue to the lowest eigenvalue. A large eigenvalue spread significantly slows down the rate of convergence for most adaptive algorithms.

However, the RLS algorithm typically requires extensive computational resources and can be prohibitive for embedded systems. Accordingly, there is a need to provide a mechanism by which the computational requirements of an RLSL structure adaptive filter are reduced.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1 a-1 d illustrate four schematic diagrams of applications employing an adaptive filter;

FIG. 2 is a block diagram of a RLSL structure adaptive filter according to the invention;

FIG. 3 is a block diagram of a backward reflection coefficient update of the adaptive filter of FIG. 2;

FIG. 4 is a block diagram of a forward reflection coefficient update of the adaptive filter of FIG. 2;

FIG. 5 is a graph illustrating backward error prediction squares for fifty samples of an input signal;

FIG. 6 is a graph illustrating forward error prediction squares for fifty samples of the input signal;

FIG. 7 is a graph illustrating echo return loss enhancements (ERLE) sing limited recursion for backward prediction;

FIG. 8 is a graph illustrating a performance of the adaptive filter of FIG. 2 versus a number of recursions of backward error prediction squares updates; and

FIG. 9 is a graph illustrating measured timing requirements versus a number of forward and backward error prediction updates;

FIG. 10 is a graph illustrating measured timing requirements versus a number of forward and backward error prediction updates; and

FIG. 11 is a block diagram of a communication device employing an adaptive filter.

Illustrative and exemplary embodiments of the invention are described in further detail below with reference to and in conjunction with the figures.

DETAILED DESCRIPTION

A method for reducing a computational complexity of an m-stage adaptive filter is provided by updating recursively forward and backward error prediction square terms for a first portion of a length of the adaptive filter, and keeping the updated forward and backward error prediction square terms constant for a second portion of the length of the adaptive filter. The present invention is defined by the appended claims. This description addresses some aspects of the present embodiments and should not be used to limit the claims.

FIGS. 1 a-1 d illustrate four schematic diagrams of filter circuits 90 employing an adaptive filter 10. The filter circuits 90 in general and the adaptive filter 10 may be constructed in any suitable manner. In particular, the adaptive filter 10 may be formed using electrical components such as digital and analog integrated circuits. In other examples, the adaptive filter 10 is formed using a digital signal processor (DSP) operating in response to stored program code and data maintained in a memory. The DSP and memory may be integrated in a single component such as an integrated circuit, or may be maintained separately. Further, the DSP and memory may be components of another system, such as a speech processing system or a communication device.

In general, an input signal u(n) is supplied to the filter circuit 90 and to the adaptive filter 10. As shown, the adaptive filter 10 may be configured in a multitude of arrangements between a system input and a system output. It is intended that the improvements described herein may be applied to the widest variety of applications for the adaptive filter 10.

In FIG. 1 a, an identification type application of the adaptive filter 10 is shown. In FIG. 1 a, the filter circuit 90 includes an adaptive filter 10, a plant 14 and a summer. The plant 14 may be any suitable signal source being monitored. In this arrangement, the input signal u(n) received at an input 12 and is supplied to the adaptive filter 10 and to a signal processing plant 14 from a system input 16. A filtered signal y(n) 18 produced at an output by adaptive filter 10 is subtracted from a signal d(n) 20 supplied by plant 14 at an output to produce an error signal e(n) 22. The error signal e(n) 22 is fed back to the adaptive filter 10. In this identification type application, signal d(n) 20 also represents an output signal of the system output 24.

In FIG. 1 b, an inverse modeling type application of the adaptive filter 10 is shown. In FIG. 1 b, the filter circuit 100 includes an adaptive filter 10, a plant 14, a summer and a delay process 26. In this arrangement, an input signal originating from system input 16 is transformed into the input signal u(n) 12 of the adaptive filter 10 by plant 14, and converted into signal d(n) 20 by a delay process 26. Filtered signal y(n) 18 of the adaptive filter 10 is subtracted from signal d(n) 20 to produce error signal e(n) 22, that is fed back to the adaptive filter 10.

In FIG. 1 c, a prediction type application of the adaptive filter 10 is shown. In FIG. 1 c, the filter circuit 100 includes an adaptive filter 10, a summer and a delay process 26. In this arrangement, adaptive filter 10 and delay process 26 are arranged in series between system input 16, now supplying a random signal input 28, and the system output 24. As shown, the random signal input 28 is subtracted as signal d(n) 20 from filtered signal y(n) 18 to produce error signal e(n) 22, that is fed back to the adaptive filter 10. In this prediction type application, error signal e(n) 22 also represents the output signal supplied by system output 24.

In FIG. 1 d, an interference canceling type application of the adaptive filter 10 is shown. In FIG. 1 d, the filter circuit 100 includes an adaptive filter 10 and a summer. In this arrangement, a reference signal 30 and a primary signal 32 are provided as input signal u(n) 12 and as signal d(n) 20, respectively. As shown, primary signal 32 is subtracted as signal d(n) 20 from filtered signal y(n) 18 to produce error signal e(n) 22, that is fed back to the adaptive filter 10. In this interference canceling type application, error signal e(n) 22 also represents the output signal supplied the system output 24.

Now referring to FIG. 2, a block diagram of an m-stage RLSL structure adaptive filter (RLSL) 100 is shown. The adaptive filter 100 includes a plurality of stages including a first stage 120 and an m-th stage 122. Each stage (m) may be characterized by a forward prediction error η_(m)(n) 102, a forward prediction error η_(m−1)(n) 103, a forward reflection coefficient K_(f,m−1)(n−1) 104, a delayed backward prediction error β_(m−1)(n) 105, a backward prediction error β(n) 106, a backward reflection coefficient K_(b,m−1)(n−1) 107, an a priori estimation error backward ξ_(m)(n) 108, an a priori estimation error backward ξ_(m−1)(n) 109 and a joint process regression coefficient K_(m−1)(n−1) 110. This m-stage adaptive RLSL filter 100 is shown with filter coefficients updates indicated by arrows drawn through each coefficient block. These filter coefficient updates are recursively computed for each stage (m) of a filter length of the RLSL 100 and for each sample time (n) of the input signal u(n) 12.

An RLSL algorithm for the RLSL 100 is defined below in terms of Equation 1 through Equation 8.

$\begin{matrix} {{F_{m - 1}(n)} = {{\lambda\;{F_{m - 1}\left( {n - 1} \right)}} + {{\gamma_{m - 1}\left( {n - 1} \right)}{{\eta_{m - 1}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 1} \\ {{B_{m - 1}\left( {n - 1} \right)} = {{\lambda\;{B_{m - 1}\left( {n - 2} \right)}} + {{\gamma_{m - 1}\left( {n - 1} \right)}{{\beta_{m - 1}\left( {n - 1} \right)}}^{2}}}} & {{Equation}\mspace{20mu} 1} \\ {{\eta_{m}(n)} = {{\eta_{m - 1}(n)} + {{K_{f,m}\left( {n - 1} \right)}{\beta_{m - 1}\left( {n - 1} \right)}}}} & {{Equation}\mspace{20mu} 2} \\ {{\beta_{m}(n)} = {{\beta_{m - 1}\left( {n - 1} \right)} + {{K_{b,m}\left( {n - 1} \right)}{\eta_{m - 1}(n)}}}} & {{Equation}\mspace{20mu} 3} \\ {{K_{f,m}(n)} = {{K_{f,m}\left( {n - 1} \right)} - {\frac{{\gamma_{m - 1}\left( {n - 1} \right)}{\beta_{m - 1}\left( {n - 1} \right)}}{B_{m - 1}\left( {n - 1} \right)}{\eta_{m}(n)}}}} & {{Equation}\mspace{20mu} 4} \\ {{K_{b,m}(n)} = {{K_{b,m}\left( {n - 1} \right)} - {\frac{{\gamma_{m - 1}\left( {n - 1} \right)}{\eta_{m - 1}(n)}}{F_{m - 1}(n)}{\beta_{m}(n)}}}} & {{Equation}\mspace{20mu} 5} \\ {{\gamma_{m}\left( {n - 1} \right)} = {{\gamma_{m - 1}\left( {n - 1} \right)} - \frac{{\gamma_{m - 1}^{2}\left( {n - 1} \right)}{{\beta_{m - 1}\left( {n - 1} \right)}}^{2}}{B_{m - 1}\left( {n - 1} \right)}}} & {{Equation}\mspace{20mu} 6} \\ {{\xi_{m}(n)} = {{\xi_{m - 1}(n)} - {{K_{m - 1}\left( {n - 1} \right)}{\beta_{m - 1}(n)}}}} & {{Equation}\mspace{20mu} 7} \\ {{K_{m - 1}(n)} = {{K_{m - 1}\left( {n - 1} \right)} + {\frac{{\gamma_{m - 1}(n)}{\beta_{m - 1}(n)}}{B_{m - 1}(n)}{\xi_{m}(n)}}}} & {{Equation}\mspace{20mu} 8} \end{matrix}$

Where the filter coefficient updates are defined as follows:

-   F_(m)(n) Weighted sum of forward prediction error squares for stage     m at time n. -   B_(m)(n) Weighted sum of backward prediction error squares for stage     m at time n. -   η_(m)(n) Forward prediction error. -   β_(m)(n) Backward prediction error. -   K_(b,m)(n) Backward reflection coefficient for stage m at time n. -   K_(f,m)(n) Forward reflection coefficient for stage m at time n. -   K_(m)(n) Joint process regression coefficient for stage m at time n. -   γ_(m)(n) Conversion factor for stage m at time n. -   ξ_(m)(n) A priori estimation error for stage m at time n. -   λ Exponential weighting factor or gain factor.

At stage zero, the RLSL 100 is supplied by signals u(n) 12 and d(n) 20. Subsequently, for each stage m, the above defined filter coefficient updates are recursively computed. For example at stage m and time n, the forward prediction error η(n) 102 is the forward prediction error ηm−1 (n) 103 of stage m−1 augmented by a combination of the forward reflection coefficient Kf,m−1(n−1) 104 with the delayed backward prediction error βm−1 (n) 105.

In a similar fashion, at stage m and time n, the backward prediction error βm (n) 106 is the backward prediction error βm−1 (n) 105 of stage m−1 augmented by a combination of the backward reflection coefficient Kb,m(n−1) 107 with the delayed forward prediction error ηm−1 (n) 103.

Moreover, a-priori estimation error backward ξm+1(n) 108, for stage m at time n, is the a priori estimation error backward ξm (n) 109 of stage m−1 reduced by a combination of the joint process regression coefficient Km−1(n−1) 110, of stage m−1 at time n−1, with the backward forward prediction error βm−1 (n) 105.

The adaptive filter 100 may be implemented using any suitable component or combination of components. In one embodiment, the adaptive filter is implemented using a DSP in combination with instructions and data stored in an associated memory. The DSP and memory may be part of any suitable system for speech processing or manipulation. The DSP and memory can be a stand-alone system or embedded in another system.

This RLSL algorithm requires extensive computational resources and can be prohibitive for embedded systems. As such, a mechanism for reducing the computational requirements of an RLSL adaptive filter 100 is obtained by reducing a number of calculated updates of the forward error prediction squares Fm(n) from backward error prediction squares Bm (n).

Typically, processors are substantially efficient at adding, subtracting and multiplying, but not necessarily at dividing. Most processors use a successive approximation technique to implement a divide instruction and may require multiple clock cycles to produce a result. As such, in an effort to reduce computational requirements, a total number of computations in the filter coefficient updates may need to be reduced as well as a number of divides that are required in the calculations of the filter coefficient updates. Thus, the RLSL algorithm filter coefficient updates are transformed to consolidate the divides. First, the time (n) and order (m) indices of the RLSL algorithm are translated to form Equation 9 through Equation 17.

$\begin{matrix} {{F_{m}(n)} = {{\lambda\;{F_{m}\left( {n - 1} \right)}} + {{\gamma_{m}\left( {n - 1} \right)}{{\eta_{m}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 9} \\ {{B_{m}(n)} = {{\lambda\;{B_{m}\left( {n - 1} \right)}} + {{\gamma_{m}(n)}{{\beta_{m}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 10} \\ {{\eta_{m}(n)} = {{\eta_{m - 1}(n)} + {{K_{f,m}\left( {n - 1} \right)}{\beta_{m - 1}\left( {n - 1} \right)}}}} & {{Equation}\mspace{20mu} 11} \\ {{\beta_{m}(n)} = {{\beta_{m - 1}\left( {n - 1} \right)} + {{K_{b,m}\left( {n - 1} \right)}{\eta_{m - 1}(n)}}}} & {{Equation}\mspace{20mu} 12} \\ {{K_{f,m}(n)} = {{K_{f,m}\left( {n - 1} \right)} - {\frac{{\gamma_{m - 1}\left( {n - 1} \right)}{\beta_{m - 1}\left( {n - 1} \right)}}{B_{m - 1}\left( {n - 1} \right)}{\eta_{m}(n)}}}} & {{Equation}\mspace{20mu} 13} \\ {{K_{b,m}(n)} = {{K_{b,m}\left( {n - 1} \right)} - {\frac{{\gamma_{m - 1}\left( {n - 1} \right)}{\eta_{m - 1}(n)}}{F_{m - 1}(n)}{\beta_{m}(n)}}}} & {{Equation}\mspace{20mu} 14} \\ {{\gamma_{m}(n)} = {{\gamma_{m - 1}(n)} - \frac{{\gamma_{m - 1}^{2}(n)}{{\beta_{m - 1}(n)}}^{2}}{B_{m - 1}(n)}}} & {{Equation}\mspace{20mu} 15} \\ {{\xi_{m}(n)} = {{\xi_{m - 1}(n)} - {{K_{m - 1}\left( {n - 1} \right)}{\beta_{m - 1}(n)}}}} & {{Equation}\mspace{20mu} 16} \\ {{K_{m}(n)} = {{K_{m}\left( {n - 1} \right)} + {\frac{{\gamma_{m}(n)}{\beta_{m}(n)}}{B_{m}(n)}{\xi_{m + 1}(n)}}}} & {{Equation}\mspace{20mu} 17} \end{matrix}$

Then, the forward error prediction squares Fm(n) and the backward error prediction squares Bm(n) are inverted and redefined to be their reciprocals as shown in Equation 18, Equation 20 and Equation 21. Thus, by inverting Equation 9 we get:

$\begin{matrix} {\frac{1}{F_{m}(n)} = \frac{1}{{\lambda\;{F_{m}\left( {n - 1} \right)}} + {{\gamma_{m}\left( {n - 1} \right)}{{\eta_{m}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 18} \end{matrix}$

Then redefine the forward error prediction squares Fm(n):

$\begin{matrix} {F^{\prime} = \frac{1}{F}} & {{Equation}\mspace{20mu} 19} \end{matrix}$

Then insert into Equation 18 and simplify:

$\begin{matrix} {{F_{m}^{\prime}(n)} = {\frac{1}{{\lambda\frac{1}{F_{m}^{\prime}\left( {n - 1} \right)}} + {{\gamma_{m}\left( {n - 1} \right)}{{\eta_{m}(n)}}^{2}}} = \frac{F_{m}^{\prime}\left( {n - 1} \right)}{\lambda + {{F_{m}^{\prime}\left( {n - 1} \right)}{\gamma_{m}\left( {n - 1} \right)}{{\eta_{m}(n)}}^{2}}}}} & {{Equation}\mspace{20mu} 20} \end{matrix}$

By the same reasoning the backwards error prediction square Equation 10 becomes

$\begin{matrix} {{B_{m}^{\prime}(n)} = \frac{B_{m}^{\prime}\left( {n - 1} \right)}{\lambda + {{B_{m}^{\prime}\left( {n - 1} \right)}{\lambda_{m}(n)}{{\beta_{m}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 21} \end{matrix}$

Further, new definitions for the forward and backward error prediction squares, F′m (n) and B′m(n), are inserted back into the remaining equations, Equation 13, Equation 14, Equation 15, and Equation 17, to produce the algorithm coefficient updates as shown below in Equation 22 through Equation 30.

$\begin{matrix} {{F_{m}^{\prime}(n)} = \frac{F_{m}^{\prime}\left( {n - 1} \right)}{\lambda + {{F_{m}^{\prime}\left( {n - 1} \right)}{\gamma_{m}\left( {n - 1} \right)}{{\eta_{m}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 22} \\ {{B_{m}^{\prime}(n)} = \frac{B_{m}^{\prime}\left( {n - 1} \right)}{\lambda + {{B_{m}^{\prime}\left( {n - 1} \right)}{\gamma_{m}(n)}{{\beta_{m}(n)}}^{2}}}} & {{Equation}\mspace{20mu} 23} \\ {{\beta_{m}(n)} = {{\beta_{m - 1}\left( {n - 1} \right)} + {{K_{b,m}\left( {n - 1} \right)}{\eta_{m - 1}(n)}}}} & {{Equation}\mspace{20mu} 24} \\ {{K_{b,m}(n)} = {{K_{b,m}\left( {n - 1} \right)} - {{\gamma_{m - 1}\left( {n - 1} \right)}{\eta_{m - 1}(n)}{\beta_{m}(n)}{F_{m - 1}^{\prime}(n)}}}} & {{Equation}\mspace{20mu} 25} \\ {{\eta_{m}(n)} = {{\eta_{m - 1}(n)} + {{K_{f,m}\left( {n - 1} \right)}{\beta_{m - 1}\left( {n - 1} \right)}}}} & {{Equation}\mspace{20mu} 26} \\ {{K_{f,m}(n)} = {{K_{f,m}\left( {n - 1} \right)} - {{\gamma_{m - 1}\left( {n - 1} \right)}{\beta_{m - 1}\left( {n - 1} \right)}{\eta_{m}(n)}{B_{m - 1}^{\prime}\left( {n - 1} \right)}}}} & {{Equation}\mspace{20mu} 27} \\ {{\xi_{m}(n)} = {{\xi_{m - 1}(n)} - {{K_{m - 1}\left( {n - 1} \right)}{\beta_{m - 1}(n)}}}} & {{Equation}\mspace{20mu} 28} \\ {{K_{m}(n)} = {{K_{m}\left( {n - 1} \right)} + {{\gamma_{m}(n)}{\beta_{m}(n)}{\xi_{m + 1}(n)}{B_{m}^{\prime}(n)}}}} & {{Equation}\mspace{20mu} 29} \\ {{\gamma_{m}(n)} = {{\gamma_{m - 1}(n)} - {{\gamma_{m - 1}^{\prime}(n)}{{\beta_{m - 1}(n)}}^{2}{B_{m - 1}^{\prime}(n)}}}} & {{Equation}\mspace{20mu} 30} \end{matrix}$

Now referring to FIG. 3, a block diagram of the backward reflection coefficient update Kb,m(n) 30 as evaluated in Equation 25 is shown. The block diagram of FIG. 3 is representative of, for example, a DSP operation or group of operations. The backward reflection coefficient update Kb,m(n) 30 is supplied to a delay 32 and the output of delay 32 Kb,m(n−1) is summed to a product of the forward error prediction squares F′m (n) with the backward prediction error βm(n), the forward prediction error ηm−1(n), and the conversion factor γm(n−1).

Now referring to FIG. 4, a block diagram of the forward reflection coefficient update Kf,m(n) 40 as evaluated in Equation 28 is shown. Similar to FIG. 3, the block diagram of FIG. 4 is representative of, for example, a DSP operation or group of operations. The backward reflection coefficient update Kb,m(n) 40 is supplied to a delay 42. The output of delay 42 Kf,m(n−1) is summed to a product of the backward error prediction squares B′m−1 (n−1) with the backward prediction error βm−1(n), the forward prediction error ηm(n), and the conversion faction γm−1(n−1).

In FIG. 5 and FIG. 6, the forward and backward error prediction squares, Fm (n) and Bm(n), are plotted against the length of the filter for 50 samples of input signal u(n) 12 during a condition of high convergence. These plots clearly indicate that the error prediction squares Fm (n) and Bm(n), ramp up quickly and then flatten out for the higher order taps of the adaptive filter 10. As such, one can infer that most of the information is substantially contained in the first few recursions of the RLSL algorithm and that a reduction in the number of coefficient updates can achieve acceptable filter performance.

Thus, a good mechanism for trading performance with computational requirements is to reduce the number of recursions or updates performed on the forward and backward error prediction squares, Fm (n) and Bm(n), to a predefined portion of the filter length. Then, the error prediction squares are held constant for the remainder of the filter tap updates. A minimal loss in a performance of the adaptive filter may result as the number of updates is decreased, but a gain in real-time performance can justify the minimal loss in filter performance.

FIG. 8 illustrates graphically the loss in performance of a 360 tap filter when the forward and backward error prediction squares, Fm (n) and Bm(n), are held constant after only 100 updates of the filter. This graph shows the echo return loss enhancement (ERLE) in dB of the filter for a 360 tap filter for both the full filter update and one with the error prediction updates calculated for only the first 100 taps of the 360 tap filter.

To generate the plot of FIG. 9, this process of limiting updates performed on the forward and backward error prediction squares, Fm (n) and Bm(n), to a predefined portion of the filter length was repeated for different limits applied to the number of error prediction updates and plotted against the ERLE of the adaptive filter 10. This plot of FIG. 9 shows how the filter performance degrades as the number of error prediction updates is reduced. Moreover, this FIG. 9 plot indicates that there is minimal improvement in filter performance in updating the error prediction squares beyond about 180 (half) filter taps.

Now referring to FIG. 10, a graph illustrating measured timing requirements versus a number of forward and backward error prediction updates, Fm (n) and Bm(n). This FIG. 10 graph is included to serve as an aide in determining the proper trade-off between computational requirements and peak filter performance. This graph plots the measured timing requirements of the RLSL filter 10 vs. the number of forward and backward error prediction squares updated for a 360 tap length filter. These values reflect measurements taken on a real-time hardware implementation. As expected the timing decreases linearly as the number of updates is reduced.

In the final realization of the optimized RLSL algorithm, the recursion loop is broken into two parts. The first part is the full set of updates as shown in Equation 22 through Equation 30. These updates are performed as normal up to a predefined number of taps of the filter. The exact number of taps needed of course is determined by the trade off analysis between real time and filter performance. The second part of the optimized RLSL algorithm is given by Equation 31 through Equation 37. In these series of recursive updates, the forward and backward error prediction squares, Fm (n) and Bm(n), are held constant at the last value calculated from the first part of the optimized algorithm.

For the remaining filter updates the forward error prediction square term (Fc) remains constant and is used in Equation 32 to update the backward reflection coefficient Kb,m(n). Moreover, the backward error prediction square term (Bc) remains constant for the remainder of the filter updates and is used in Equation 34 to update the forward reflection coefficient Kf,m(n). β_(m)(n)=β_(m−1)(n−1)+K _(b,m)(n−1)η_(m−1)(n)  Equation 31 K _(b,m)(n)=K _(b,m)(n−1)−γ_(m−1)(n−1)η_(m−1)(n)β_(m)(n)F _(c)  Equation 32 η_(m)(n)=η_(m−1)(n)+K _(f,m)(n−1)β_(m−1)(n−1)  Equation 33 K _(f,m)(n)=K _(f,m)(n−1)−γ_(m−1)(n−1)β_(m−1)(n−1)η_(m)(n)B _(c)  Equation 34 ξ_(m)(n)=ξ_(m−1)(n)−K _(m−1)(n−1)β_(m−1)(n)  Equation 35 K _(m)(n)=K _(m)(n−1)+γ_(m)(n)β_(m)(n)ξ_(m+1)(n)B _(c)  Equation 36 γ_(m)(n)=γ_(m−1)(n)−γ² _(m−1)(n)|β_(m−1)(n)|² B _(c)  Equation 37

FIG. 11 is a block diagram of a communication device 1100 employing an adaptive filter. The communication device 1100 includes a DSP 1102, a microphone 1104, a speaker 1106, an analog signal processor 1108 and a network connection 1110. The DSP 1102 may be any processing device including a commercially available digital signal processor adapted to process audio and other information.

The communication device 1100 includes a microphone 1104 and speaker 1106 and analog signal processor 1108. The microphone 1104 converts sound waves impressed thereon to electrical signals. Conversely, the speaker 1106 converts electrical signals to audible sound waves. The analog signal processor 1108 serves as an interface between the DSP, which operates on digital data representative of the electrical signals, and the electrical signals useful to the microphone 1104 and 1106. In some embodiments, the analog signal processor 1108 may be integrated with the DSP 1102.

The network connection 1110 provides communication of data and other information between the communication device 1100 and other components. This communication may be over a wire line, over a wireless link, or a combination of the two. For example, the communication device 1100 may be embodied as a cellular telephone and the adaptive filter 1112 operates to process audio information for the user of the cellular telephone. In such an embodiment, the network connection 1110 is formed by the radio interface circuit that communicates with a remote base station. In another embodiment, the communication device 1100 is embodied as a hands-free, in-vehicle audio system and the adaptive filter 1112 is operative to serve as part of a double-talk detector of the system. In such an embodiment, the network connection 1110 is formed by a wire line connection over a communication bus of the vehicle.

In the embodiment of FIG. 11, the DSP 1102 includes data and instructions to implement an adaptive filter 1112, a memory 1114 for storing data and instructions and a processor 1116. The adaptive filter 1112 in this embodiment is an RLSL adaptive filter of the type generally described herein. In particular, the adaptive filter 1112 is enhanced to reduce the number of calculations required to implement the RLSL algorithm as described herein. The adaptive filter 1112 may include additional enhancements and capabilities beyond those expressly described herein. The processor 1116 operates in response to the data and instructions implementing the adaptive filter 1112 and other data and instructions stored in the memory 1114 to process audio and other information of the communication device 1100.

In operation, the adaptive filter 1112 receives an input signal from a source and provides a filtered signal as an output. In the illustrated embodiment, the DSP 1102 receives digital data from either the analog signal processor 1108 or the network interface 1110. The analog signal processor 1108 and the network interface 1110 thus form means for receiving an input signal. The digital data is representative of a time-varying signal and forms the input signal. As part of audio processing, the processor 1116 of DSP 1102 implements the adaptive filter 1112. The data forming the input signal is provided to the instructions and data forming the adaptive filter. The adaptive filter 1112 produces an output signal in the form of output data. The output data may be further processed by the DSP 1102 or passed to the analog signal processor 1108 or the network interface 1110 for further processing.

The communication device 1100 may be modified and adapted to other embodiments as well. The embodiments shown and described herein are intended to be exemplary only.

It is therefore intended that the foregoing detailed description be regarded as illustrative rather than limiting, and that it be understood that it is the following claims, including all equivalents, that are intended to define the spirit and scope of this invention. 

1. A method for an m-stage recursive least squares lattice structure adaptive filter, the method comprising: receiving an input signal at an interface of the adaptive filter; recursively updating filter coefficients for each stage of the adaptive filter with a processor operative in conjunction with stored data and instructions for each stage of the adaptive filter, including reducing a number of updates of a forward error prediction squares and backward error prediction squares of the filter coefficients by performing the updates up to a predefined number of stages of the adaptive filter, and holding the forward error prediction squares and the backward error prediction squares constant during the remainder of the stages of the adaptive filter; and producing a filtered signal as an output signal of the adaptive filter at an interface of the adaptive filter.
 2. The method of claim 1 wherein updating filter coefficients comprises limiting updating of the forward error prediction squares and the backward error prediction squares to a predefined portion of filter length.
 3. The method of claim 2 wherein limiting updating of the forward error prediction squares and the backward error prediction squares to a predefined portion of the filter length comprises updating the forward error prediction squares and the backward error prediction squares of approximately one-half of all filter stages.
 4. The method of claim 1 wherein receiving an input signal comprises receiving digital data representative of a time-varying signal.
 5. A method for reducing computational complexity of an in-stage adaptive filter, the method comprising: receiving an input signal at an input interface of the adaptive filter; filtering the input signal by a processor operative in conjunction with stored data and instructions for each stage of the adaptive filter, to produce a filtered signal, including updating recursively a forward error prediction square term for a first portion of a length of the adaptive filter; updating recursively a backward error prediction square term for the first portion of the length of the adaptive filter; and keeping the updated forward and backward error prediction square terms constant for a second portion of the length of the adaptive filter; and providing the filtered signal at an output interface of the adaptive filter.
 6. The method of claim 5 wherein updating the forward error prediction square term comprises updating the forward error prediction square term for approximately one-half of the length of the adaptive filter and updating the backward error prediction square term comprises updating the backward error prediction square term for approximately one-half of the length of the adaptive filter.
 7. The method of claim 5 wherein further comprising: updating all filter coefficients up to a predefined number of taps of the adaptive filter for a first set of filter updates; and holding constant the forward error prediction square term and the backward error prediction square term while updating the rest of the filter coefficients during a second set of filter updates.
 8. The method of claim 7 further comprising: during the second set of filter updates, using the constant forward error prediction square term to update a backward reflection coefficient; and using the constant backward error prediction square term to update a forward reflection coefficient.
 9. An m-stage adaptive filter comprising: an interface to receive an input signal; a processor operative in conjunction with stored data and instructions to recursively update filter coefficients for each stage of the adaptive filter while producing a filtered signal, the processor configured to reduce a number of updates of the forward error prediction squares and backward error prediction squares of the filter coefficients by performing the updates up to a predefined number of stages of the adaptive filter, and hold the forward error prediction squares and the backward error prediction squares constant during the remainder of the stages of the adaptive filter; and an interface to provide the filtered signal as an output signal.
 10. The adaptive filter of claim 9 wherein the processor is operative to update recursively the forward error prediction squares for a first portion of a length of the adaptive filter; update recursively the backward error prediction squares for the first portion of the length of the adaptive filter; and keep the updated forward error prediction squares and backward error prediction squares constant for a second portion of the length of the adaptive filter.
 11. The adaptive filter of claim 10 wherein the processor is operative to update all filter coefficients up to a predefined number of taps of the adaptive filter for a first set of filter updates; and hold constant the forward error prediction squares and the backward error prediction squares while updating the rest of the filter coefficients during a second set of filter updates. 